We address a dynamic repair shop scheduling problem in the context ofmilitary aircraft fleet management where the goal is to maintain a fullcomplement of aircraft over the long-term. A number of flights, each with arequirement for a specific number and type of aircraft, are already scheduledover a long horizon. We need to assign aircraft to flights and schedule repairactivities while considering the flights requirements, repair capacity, andaircraft failures. The number of aircraft awaiting repair dynamically changesover time due to failures and it is therefore necessary to rebuild the repairschedule online. To solve the problem, we view the dynamic repair shop assuccessive static repair scheduling sub-problems over shorter time periods. Wepropose a complete approach based on the logic-based Benders decomposition tosolve the static sub-problems, and design different rescheduling policies toschedule the dynamic repair shop. Computational experiments demonstrate thatthe Benders model is able to find and prove optimal solutions on average fourtimes faster than a mixed integer programming model. The rescheduling approachhaving both aspects of scheduling over a longer horizon and quickly adjustingthe schedule increases aircraft available in the long term by 10% compared tothe approaches having either one of the aspects alone.
展开▼
